Reasoning with Higher Order Partial Functions
نویسندگان
چکیده
In this paper we introduce the logic P HOL, which embodies higher-order functions through a simply-typed-calculus and deals with partial objects by using partially ordered domains and three truth values. We deene a refutationally complete tableaux method for P HOL and we show how to derive a sound and complete cut free sequent calculus through a systematic analysis of the rules for tableaux construction.
منابع مشابه
Partial second-order subdifferentials of -prox-regular functions
Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2 functions. The class of prox-regular functions covers all convex functions, lower C2 functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...
متن کاملPartial Recursive Functions in Higher-Order Logic
Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for them. Our method expresses termination in a uniform manner and includes a very general form of pattern matching, where patterns can be arbitrary expressions. Termination proofs can be deferred, restricted to subsets of argument...
متن کاملA Practical Approach to Partiality - A Proof Based Approach
Partial functions are frequently used when specifying and reasoning about computer programs. Using partial functions entails reasoning about potentially ill-defined expressions. In this paper we show how to formally reason about partial functions without abandoning the well understood domain of classical two-valued predicate calculus. In order to achieve this, we extend standard predicate calcu...
متن کاملA Set Theory with Support for Partial Functions
Partial functions can be easily represented in set theory as certain sets of ordered pairs. However, classical set theory provides no special machinery for reasoning about partial functions. For instance, there is no direct way of handling the application of a function to an argument outside its domain as in partial logic. There is also no utilization of lambda-notation and sorts or types as in...
متن کاملTermination Analysis for Offline Partial Evaluation of a Higher Order Functional Language
One of the remaining problems on the path towards fully automatic partial evaluation is ensuring termination of the specialization phase. In [10] we gave a termination analysis which could be applied to partial evaluation of first-order strict languages, using a new result about inductive arguments (loosely: if whenever something grows, something gets smaller then the program will only enter fi...
متن کامل